Moment Inequalities for the Maximum Cumulative Sum
نویسندگان
چکیده
منابع مشابه
The Innovation Cumulative Sum Chart
This paper investigates the acceptable quality level under which quality characteristics have a normal probability distribution with an unknown location parameter. The traditional cumulative sum depends on the unknown parameter, and hence can not be used. Replacing the unknown parameter by its estimator yields the estimated cumulative sum, but the replacement clearly aaects the behavior under t...
متن کاملAlternative models for moment inequalities
Behavioral choice models generate inequalities which, when combined with additional assumptions, can be used as a basis for estimation. This paper considers two sets of such assumptions and uses them in two empirical examples. The second example examines the structure of payments resulting from the upstream interactions in a vertical market. We then mimic the empirical setting for this example ...
متن کاملCumulative Sum Charts for High Yield Processes
The cumulative sum (CUSUM) chart, well-known to be sensitive in detecting small and moderate parameter changes, is proposed here for monitoring a high yield process. The sensitivities of the CUSUM charts based on geometric, Bernoulli and binomial counts are compared. Based on the comparisons, recommendations for the selection of a chart are provided. Simple procedures are given for optimal desi...
متن کاملassessment of the park- ang damage index for performance levels of rc moment resisting frames
چکیده هدف اصلی از طراحی لرزه ای تامین ایمنی جانی در هنگام وقوع زلزله و تعمیر پذیر بودن سازه خسارت دیده، پس از وقوع زلزله است. تجربه زلزله های اخیر نشان داده است که ساختمان های طراحی شده با آیین نامه های مبتنی بر نیرو از نظر محدود نمودن خسارت وارده بر سازه دقت لازم را ندارند. این امر سبب پیدایش نسل جدید آیین نامه های مبتنی بر عملکرد شده است. در این آیین نامه ها بر اساس تغییرشکل های غیرارتجاعی ...
15 صفحه اولEfficient Algorithms for the Maximum Sum Problems
We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS) problem. In the MSA problem, we find a rectangular part within the given data array that maximizes the sum in it. The MCS problem is to find a conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1970
ISSN: 0003-4851
DOI: 10.1214/aoms/1177696898